Stability and instability of limit points for stochastic approximation algorithms
نویسندگان
چکیده
It is shown that the limit points of a stochastic approximation (SA) algorithm compose a connected set. Conditions are given to guarantee the uniqueness of the limit point for a given initial value. Examples are provided wherein of SA algorithm converges to a limit independent of initial values, but is unstable for the differential equation _ = ( ) with a nonnegative Lyapunov function. Finally, sufficient conditions are given for stability of _ = ( ) at if tends to for any initial values.
منابع مشابه
APPROXIMATION OF STOCHASTIC PARABOLIC DIFFERENTIAL EQUATIONS WITH TWO DIFFERENT FINITE DIFFERENCE SCHEMES
We focus on the use of two stable and accurate explicit finite difference schemes in order to approximate the solution of stochastic partial differential equations of It¨o type, in particular, parabolic equations. The main properties of these deterministic difference methods, i.e., convergence, consistency, and stability, are separately developed for the stochastic cases.
متن کاملApproximation of stochastic advection diffusion equations with finite difference scheme
In this paper, a high-order and conditionally stable stochastic difference scheme is proposed for the numerical solution of $rm Ithat{o}$ stochastic advection diffusion equation with one dimensional white noise process. We applied a finite difference approximation of fourth-order for discretizing space spatial derivative of this equation. The main properties of deterministic difference schemes,...
متن کاملBlowing-up of deterministic fixed points in stochastic population dynamics.
We discuss the stochastic dynamics of biological (and other) populations presenting a limit behaviour for large environments (called deterministic limit) and its relation with the dynamics in the limit. The discussion is circumscribed to linearly stable fixed points of the deterministic dynamics, and it is shown that the cases of extinction and non-extinction equilibriums present different feat...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Automat. Contr.
دوره 45 شماره
صفحات -
تاریخ انتشار 2000